Optimal Path Finding Method Study Based on Stochastic Travel Time
نویسندگان
چکیده
Finding optimal path in a given network is an important content of intelligent transportation information service. Static shortest path has been studied widely and many efficient searching methods have been developed, for example Dijkstra’s algorithm, Floyd-Warshall, Bellman-Ford, A et al. However, practical travel time is not a constant value but a stochastic value. How to take full use of the stochastic character to find the shortest path is a significant problem. In this paper, GPS floating car is used to detect road section’s travel time. The probability distribution of travel time is estimated according to Bayes estimation method. The combined probability distribution of a feasible route is calculated according to probability operation. The objective function is to find the route that has the biggest probability to arrive for desired time thresholds. Improved Genetic Algorithm is used to calculate the optimal path. The efficiency of the proposed method is illustrated with a practical example.
منابع مشابه
On Calibration and Application of Logit-Based Stochastic Traffic Assignment Models
There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...
متن کاملMulti-objective path finding in stochastic time-dependent road networks using non-dominated sorting genetic algorithm
In this paper, a new multi-objective path-finding model is proposed to find optimal paths in road networks with time-dependent stochastic travel times. This study is motivated by the fact that different travelers usually have different route-choice preferences, often involving multiple conflicting criteria such as expected path travel time, variance of path travel time and so forth. However, mo...
متن کاملFinding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملOptimal Routing Policy Problems in Stochastic Time- Dependent Networks
We study optimal routing policy problems in stochastic time-dependent networks, where link travel times are modeled as random variables with time-dependent distributions. These are fundamental network optimization problems for a wide variety of applications, such as transportation and telecommunication systems. The routing problems studied can be viewed as counterparts of shortest path problems...
متن کاملOn finding paths and flows in multicriteria, stochastic and time-varying networks
Title of dissertation: ON FINDING PATHS AND FLOWS IN MULTICRITERIA, STOCHASTIC AND TIME-VARYING NETWORKS Sathaporn Opasanon, Doctor of Philosophy, 2004 Dissertation directed by: Professor Elise Miller -Hooks Department of Civil and Environmental Engineering This dissertation addresses two classes of network flow problems in networks with multiple, stochastic and time-varying attributes. The fir...
متن کامل